The algebraic characterizations for a formal power series over complete strong bimonoids
نویسندگان
چکیده
منابع مشابه
The algebraic characterizations for a formal power series over complete strong bimonoids
On the basis of run semantics and breadth-first algebraic semantics, the algebraic characterizations for a classes of formal power series over complete strong bimonoids are investigated in this paper. As recognizers, weighted pushdown automata with final states (WPDAs for short) and empty stack (WPDAs[Formula: see text]) are shown to be equivalent based on run semantics. Moreover, it is demonst...
متن کاملALGEBRAIC INDEPENENCE OF CERTAIN FORMAL POWER SERIES (II)
We shall extend the results of [5] and prove that if f = Z o a x ? Z [[X]] is algebraic over Q (x), where a = 1, ƒ 1 and if ? , ? ,..., ? are p-adic integers, then 1 ? , ? ,..., ? are linkarly independent over Q if and only if (1+x) ,(1+x) ,…,(1+x) are algebraically independent over Q (x) if and only if f , f ,.., f are algebraically independent over Q (x)
متن کاملALGEBRAIC INDEPENDENCE OF CERTAIN FORMAL POWER SERIES (I)
We give a proof of the generalisation of Mendes-France and Van der Poorten's recent result over an arbitrary field of positive characteristic and then by extending a result of Carlitz, we shall introduce a class of algebraically independent series.
متن کاملHYPERTRANSCENDENTAL FORMAL POWER SERIES OVER FIELDS OF POSITIVE CHARACTERISTIC
Let $K$ be a field of characteristic$p>0$, $K[[x]]$, the ring of formal power series over $ K$,$K((x))$, the quotient field of $ K[[x]]$, and $ K(x)$ the fieldof rational functions over $K$. We shall give somecharacterizations of an algebraic function $fin K((x))$ over $K$.Let $L$ be a field of characteristic zero. The power series $finL[[x]]$ is called differentially algebraic, if it satisfies...
متن کاملWeighted Tree Automata over Strong Bimonoids
We consider weighted tree automata over strong bimonoids which are, roughly speaking, semirings without distributivity. We prove sufficient and necessary conditions under which the initial algebra semantics and the run semantics of these automata coincide. We prove closure properties of the class of recognizable tree series, a determinization result, and a characterization of recognizable step ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SpringerPlus
سال: 2016
ISSN: 2193-1801
DOI: 10.1186/s40064-016-1764-x